Reversible universal quantum computation within translation invariant systems

نویسنده

  • K. G. H. Vollbrecht
چکیده

We show how to perform reversible universal quantum computation on a translationally invariant pure state, using only global operations based on next-neighbor interactions. We do not need not to break the translational symmetry of the state at any time during the computation. Since the proposed scheme fulfills the locality condition of a quantum cellular automata, we present a reversible quantum cellular automaton capable of universal quantum computation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum computation via translation-invariant operations on a chain of qubits

Symmetry reduces complexity. In physical systems realizing quantum computers, the highest degree of symmetry is therefore not the most desirable. A quantum computer needs to be sufficiently simple and robust to be controllable in an experiment yet complex enough to be universal. One may therefore ask the question, “how much symmetry does a quantum computer allow for?” In fact, a number of physi...

متن کامل

Quantum cellular automaton for universal quantum computation

A number of physical systems that are considered for the realization of a universal quantum computer, such as optical lattices 1 or arrays of microlenses 2 , possess a translation symmetry in the arrangement of qubits and their mutual interaction. Quantum cellular automata QCA represent a suitable framework to explore the computational power of such physical systems, because they respect this s...

متن کامل

Completeness of classical spin models and universal quantum computation

We study mappings between distinct classical spin systems that leave the partition function invariant. As recently shown in [Phys. Rev. Lett. 10

متن کامل

From Reversible Logic Gates to Universal Quantum Bases

With the anticipated end of Moore’s law for integrated circuits [3, 4] fast approaching and continued advances in low-power electronics, interest in quantum computing has increased. This shifts the focus from deterministic logical circuits to potentially more powerful circuits based on controllable quantum systems. In this column, we present a mathematical tour of the quantum circuit model, beg...

متن کامل

Universal construction of order parameters for translation-invariant quantum lattice systems with symmetry-breaking order.

For any translation-invariant quantum lattice system with a symmetry group G, we propose a practical and universal construction of order parameters which identify quantum phase transitions with symmetry-breaking order. They are defined in terms of the fidelity between a ground state and its symmetry-transformed counterpart, and are computed through tensor network representations of the ground-s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005